Euler Summation Formula for Path Integrals
نویسندگان
چکیده
We present and comment on some details of a new analytical method for systematic improvement of the convergence of path integrals of a generic N -fold discretized theory. The new methods represents a Euler summation formula for path integrals. Keeping the first p terms in this formula improves convergence of path integrals to the continuum limit to 1/N. We have given explicit calculations up to p = 9. We have also checked this derived speedup in convergence by performing Monte Carlo simulations on several different models.
منابع مشابه
A ug 2 00 5 Generalization of Euler ’ s summation formula to path integrals ⋆
A recently developed analytical method for systematic improvement of the convergence of path integrals is used to derive a generalization of Euler's summation formula for path integrals. The first p terms in this formula improve convergence of path integrals to the continuum limit from 1/N to 1/N p , where N is the coarseness of the discretization. Monte Carlo simulations performed on several d...
متن کاملSe p 20 05 Generalization of Euler ’ s summation formula to path
A recently developed analytical method for systematic improvement of the convergence of path integrals is used to derive a generalization of Euler's summation formula for path integrals. The first p terms in this formula improve convergence of path integrals to the continuum limit from 1/N to 1/N p , where N is the coarseness of the discretization. Monte Carlo simulations performed on several d...
متن کاملAnalogues of Euler and Poisson summation formulae
Abstract. Euler–Maclaurin and Poisson analogues of the summations ∑a<n≤b χ(n) f (n), ∑a<n≤b d(n) f (n), ∑a<n≤b d(n)χ(n) f (n) have been obtained in a unified manner, where (χ(n)) is a periodic complex sequence; d(n) is the divisor function and f (x) is a sufficiently smooth function on [a,b]. We also state a generalised Abel’s summation formula, generalised Euler’s summation formula and Euler’s...
متن کاملEuler–Maclaurin summation and Schlömilch series
A method for analysing a class of divergent series is developed from the Euler– Maclaurin summation formula. The conditions that the summand must satisfy are explored, and a significant simplification is obtained for cases where the summation ranges over all integers. As an example, we consider the Ewald representation for Schlömilch series, and show that this includes Twersky’s dual series for...
متن کاملSome Problems in Number Theory I: the Circle Problem
C.F. Gauss [Gaus1] [Gaus2] showed that the the number of lattice points in circles is the area, πt , up to a tolerance of order at most the circumference, i.e. the square root, O( √ t) . Sierpinski in 1904, following work of Voronoi [Vor] on the Dirichlet Divisor Problem, lowered the exponent in Gauss’s result to 1/3 [Sierp1] [Sierp2]. Further improvements that have been obtained will be descri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008